A Rich Paraconsistent Extension of Full Positive Logic∗
نویسندگان
چکیده
In the present paper we devise and study the most natural predicative extension of Schütte’s maximally paraconsistent logic. With some of its large fragments, this logic, CLuNs, forms the most popular family of paraconsistent logics. Devising the system involves some entanglements, and the system itself raises several interesting questions. As the system and fragments were studied by other authors, we restrict our attention to results that we have not seen in press.
منابع مشابه
Handling Inconsistency in Knowledge Bases
Real-world automated reasoning systems, based on classical logic, face logically inconsistent information, and they must cope with it. It is onerous to develop such systems because classical logic is explosive. Recently, progress has been made towards semantics that deal with logical inconsistency. However, such semantics was never analyzed in the aspect of inconsistency tolerant relational mod...
متن کاملParaconsistent default reasoning
In this paper, a novel technique called bi-default theory is proposed for handling inconsistent knowledge simultaneously in the context of default logic without leading to triviality of the extension. To this end, the positive and negative transformations of propositional formulas are defined such that the semantic link between a literal and its negation is split. It is proven that the bi-defau...
متن کاملN'5 as an Extension of G'3
We present an extension of GLukG, a logic that was introduced in [6] as a three-valued logic under the name of G3. GLukG is a paraconsistent logic defined in terms of 15 axioms, which serves as the formalism to define the p-stable semantics of logic programming. We introduce a new axiomatic system, N-GLukG, a paraconsistent logic that possesses strong negation. We use the 5-valued logic N ′ 5, ...
متن کاملAn Extended Generalized Disjunctive Paraconsistent Data Model for Disjunctive Information
This paper presents an extension of generalized disjunctive paraconsistent relational data model in which pure disjunctive positive and negative information as well as mixed disjunctive positive and negative information can be represented explicitly and manipulated. We consider explicit mixed disjunctive information in the context of disjunctive databases as there is an interesting interplay be...
متن کاملA Tableau Algorithm for Paraconsistent and Nonmonotonic Reasoning in Description Logic-Based System
This paper proposes a paraconsistent and nonmonotonic extension of description logic by planting a nonmonotonic mechanism called minimal inconsistency in paradoxical description logics, which is a paraconsistent version of description logics. A precedence relation between two paradoxical models of knowledge bases is firstly introduced to obtain minimally paradoxical models by filtering those mo...
متن کامل